منابع مشابه
Monoid Kernels and Profinite Topologies on the Free Abelian Group
To each pseudovariety of abelian groups residually containing the integers, there is naturally associated a proonite topology on any nite rank free abelian group. We show in this paper that if the pseudovariety in question has a decidable membership problem, then one can eeectively compute membership in the closure of a subgroup and more generally, in the closure of a rational subset of such a ...
متن کاملThe Free AMPLE Monoid
We show that the free weakly E-ample monoid on a set X is a full submonoid of the free inverse monoid FIM(X) on X . Consequently, it is ample, and so coincides with both the free weakly ample and the free ample monoid FAM(X) on X . We introduce the notion of a semidirect product Y ∗ T of a monoid T acting doubly on a semilattice Y with identity. We argue that the free monoid X∗ acts doubly on t...
متن کاملMonoid Automata for Displacement Context-Free Languages
In 2007 Kambites presented an algebraic interpretation of Chomsky-Schützenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of kdisplacement context-free languages in terms of monoid automata a...
متن کاملWalking automata in the free inverse monoid
In this paper, we study languages of birooted trees or, following Scheiblich-Munn’s theorem, subsets of free inverse monoids. Extending the classical notion of rational languages with a projection operator that maps every set of birooted trees to the subset of its idempotent elements it is first shown that the hierarchy induced by the nesting depth of that projection operator simply correspond ...
متن کاملThe Frobenius Problem in a Free Monoid
Given positive integers c1, c2, . . . , ck with gcd(c1, c2, . . . , ck) = 1, the Frobenius problem (FP) is to compute the largest integer g(c1, c2, . . . , ck) that cannot be written as a non-negative integer linear combination of c1, c2, . . . , ck. The Frobenius problem in a free monoid (FPFM) is a non-commutative generalization of the Frobenius problem. Given words x1, x2, . . . , xk such th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1991
ISSN: 0021-8693
DOI: 10.1016/0021-8693(91)90094-o